Algorithms for worst-case tolerance optimization
نویسندگان
چکیده
منابع مشابه
Worst Case Network Tolerance Optimization
T. K. Wu and L. L. Tsai, “Numerical analysis of electromagnetic fields in biological tissues,” Proc. IEEE (Lett.), vol. 62, pp. 1167–1168, Aug. 1974. R. F. Barrington. Field Computation by Moment Methods. New York: Macmillan, 1968, ch. 3. B. H. McDonald and A. Wexler, “Finite-element solution of unbounded field problems,” IEEE Trans. Microwave Theory Tech. (1972 Symp. Issue), vol. MTT-20, pp. 8...
متن کاملWorst - case tolerance optimization of antenna systems
The application of recently developed algorithms to antenna systems design is demonstrated by the worst-case tolerance optimization of linear broadside arrays, using both spacings and excitation coefficients as design parameters. The resulting arrays are optimally immunized against deviations of the design parameters from their nominal values. INTRODUCTION In this communication we shall be conc...
متن کاملWorst Case Competitive Analysis of Online Algorithms for Conic Optimization
Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separable concave returns. We analyze the worst case competitive ratio of two primal-dual algorithms for a class of online convex (conic) optimization problems that contains the previous examples as special cases defined o...
متن کاملAlgorithms Beyond the Worst Case
These notes describe some of the material of the course “Algorithms Beyond the Worst Case”, which is part of the Mastermath and DIAMANT programs. Last modified: May 25, 2016.
متن کاملA Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
In a multi-objective combinatorial optimization (MOCO) problem, multiple objectives must be optimized simultaneously. In past years, several constraint-based algorithms have been proposed for finding Pareto-optimal solutions to MOCO problems that rely on repeated calls to a constraint solver. Understanding the properties of these algorithms and analyzing their performance is an important proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems
سال: 1979
ISSN: 0098-4094
DOI: 10.1109/tcs.1979.1084700